Novel greedy grid-voting algorithm for optimisation placement of multi-camera
نویسندگان
چکیده
منابع مشابه
Automatic multi-camera placement and optimisation using ray tracing
An automatic method for rapid and optimised surveillance camera deployment is proposed for outdoor settings. Given a target scene, potential camera locations are generated taking account of realworld camera parameters and environmental constraints. For example, each point on a target must be viewed by at least two cameras. We employ ray tracing to determine the visibility of any point from a gi...
متن کاملA multi-tier adaptive grid algorithm for the evolutionary multi-objective optimisation of complex problems
The multi-tier Covariance Matrix Adaptation Pareto Archived Evolution Strategy (m-CMA-PAES) is an evolutionary multi-objective optimisation (EMO) algorithm for real-valued optimisation problems. It combines a nonelitist adaptive grid based selection scheme with the efficient strategy parameter adaptation of the elitist CovarianceMatrix Adaptation Evolution Strategy (CMA-ES). In the original CMA...
متن کاملCamera Placement and Multi-Camera Fusion for Remote Robot Operation
This paper studies the impact of camera location and multi-camera fusion with real robots in an urban search and rescue task through two sets of experiments. In the first, we compared a camera with an overhead view to a traditional forward looking camera. In the second, we compared the use of a single forward looking camera to the use of two cameras, one on the front of the robot and one on the...
متن کاملA Greedy Algorithm for Capacity-Constrained Surrogate Placement in CDNs
One major factor that heavily affects the performance of a content distribution network (CDN) is placement of the surrogates. Previous works take a network-centric approach and consider only the network traffic. In this paper, we propose solutions to optimal surrogate placement, taking into consideration both network latency and capacity constraints on the surrogates. For CDNs with a tree topol...
متن کاملA novel greedy algorithm for Nyström approximation
The Nyström method is an efficient technique for obtaining a low-rank approximation of a large kernel matrix based on a subset of its columns. The quality of the Nyström approximation highly depends on the subset of columns used, which are usually selected using random sampling. This paper presents a novel recursive algorithm for calculating the Nyström approximation, and an effective greedy cr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Sensor Networks
سال: 2021
ISSN: 1748-1279,1748-1287
DOI: 10.1504/ijsnet.2021.10036663